Determining of validity of speculative load data after a predetermined period of time in a multi-slice processor

ABSTRACT

Operation of a multi-slice processor that includes a plurality of execution slices and a plurality of load/store slices coupled via a results bus includes: retrieving, from the results bus into an entry of a register file of an execution slice, speculative result data of a load instruction generated by a load/store slice; and determining, from the load/store slice after expiration of a predetermined period of time, whether the result data is valid.

BACKGROUND OF THE INVENTION

Field of the Invention

The field of the invention is data processing, or, more specifically,methods and apparatus for operation of a multi-slice processor.

Description of Related Art

The development of the EDVAC computer system of 1948 is often cited asthe beginning of the computer era. Since that time, computer systemshave evolved into extremely complicated devices. Today's computers aremuch more sophisticated than early systems such as the EDVAC. Computersystems typically include a combination of hardware and softwarecomponents, application programs, operating systems, processors, buses,memory, input/output devices, and so on. As advances in semiconductorprocessing and computer architecture push the performance of thecomputer higher and higher, more sophisticated computer software hasevolved to take advantage of the higher performance of the hardware,resulting in computer systems today that are much more powerful thanjust a few years ago.

One area of computer system technology that has advanced is computerprocessors. As the number of computer systems in data centers and thenumber of mobile computing devices has increased, the need for moreefficient computer processors has also increased. Speed of operation andpower consumption are just two areas of computer processor technologythat affect efficiency of computer processors.

SUMMARY OF THE INVENTION

Methods and apparatus for operation of a multi-slice processor aredisclosed in this specification. Such a multi-slice processor includes aplurality of execution slices and a plurality of load/store slices,where the load/store slices are coupled to the execution slices via aresults bus. Operation of such a multi-slice processor includes:retrieving, from the results bus into an entry of a register file of anexecution slice, speculative result data of a load instruction generatedby a load/store slice; and determining, from the load/store slice afterexpiration of a predetermined period of time, whether the result data isvalid.

The foregoing and other objects, features and advantages of theinvention will be apparent from the following more particulardescriptions of exemplary embodiments of the invention as illustrated inthe accompanying drawings wherein like reference numbers generallyrepresent like parts of exemplary embodiments of the invention.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 sets forth a block diagram of an example system configured foroperation of a multi-slice processor according to embodiments of thepresent invention.

FIG. 2 sets forth a block diagram of a portion of a multi-sliceprocessor according to embodiments of the present invention.

FIG. 3 sets forth a flow chart illustrating an exemplary method ofoperation of a multi-slice processor.

FIG. 4 sets forth a flow chart illustrating a further exemplary methodof operation of a multi-slice processor according to embodiments of thepresent invention.

DETAILED DESCRIPTION OF EXEMPLARY EMBODIMENTS

Exemplary methods and apparatus for operation of a multi-slice processorin accordance with the present invention are described with reference tothe accompanying drawings, beginning with FIG. 1. FIG. 1 sets forth ablock diagram of an example system configured for operation of amulti-slice processor according to embodiments of the present invention.The system of FIG. 1 includes an example of automated computingmachinery in the form of a computer (152).

The computer (152) of FIG. 1 includes at least one computer processor(156) or ‘CPU’ as well as random access memory (168) (‘RAM’) which isconnected through a high speed memory bus (166) and bus adapter (158) toprocessor (156) and to other components of the computer (152).

The example computer processor (156) of FIG. 1 may be implemented as amulti-slice processor. The term ‘multi-slice’ as used in thisspecification refers to a processor having a plurality of similar oridentical sets of components, where each set may operate independentlyof all the other sets or in concert with the one or more of the othersets. The multi-slice processor (156) of FIG. 1, for example, includesseveral execution slices (‘ES’) and several load/store slices (‘LSS’).Each execution slice may be configured to provide components thatsupport execution of instructions: an issue queue, general purposeregisters, a history buffer, an arithmetic logic unit (including avector scalar unit, a floating point unit, and others), and the like.Each of the load/store slices may be configured with components thatsupport data movement operations such as loading of data from cache ormemory or storing data in cache or memory. In some embodiments, each ofthe load/store slices includes a data cache. The load/store slices arecoupled to the execution slices through a results bus. In someembodiments, each execution slice may be associated with a singleload/store slice to form a single processor slice. In some embodiments,multiple processor slices may be configured to operate together.

The example multi-slice processor (156) of FIG. 1 may also include, inaddition to the execution and load/store slices, other processorcomponents. In the system of FIG. 1, the multi-slice processor (156)includes fetch logic, dispatch logic, and branch prediction logic.Further, although in some embodiments each load/store slice includescache memory, the multi-slice processor (156) may also include cacheaccessible by any or all of the processor slices.

Although the multi-slice processor (156) in the example of FIG. 1 isshown to be coupled to RAM (168) through a front side bus (162), a busadapter (158) and a high speed memory bus (166), readers of skill in theart will recognize that such configuration is only an exampleimplementation. In fact, the multi-slice processor (156) may be coupledto other components of a computer system in a variety of configurations.For example, the multi-slice processor (156) in some embodiments mayinclude a memory controller configured for direct coupling to a memorybus (166). In some embodiments, the multi-slice processor (156) maysupport direct peripheral connections, such as PCIe connections and thelike.

Stored in RAM (168) in the example computer (152) is a data processingapplication (102), a module of computer program instructions that whenexecuted by the multi-slice processor (156) may provide any number ofdata processing tasks. Examples of such data processing applications mayinclude a word processing application, a spreadsheet application, adatabase management application, a media library application, a webserver application, and so on as will occur to readers of skill in theart. Also stored in RAM (168) is an operating system (154). Operatingsystems useful in computers configured for operation of a multi-sliceprocessor according to embodiments of the present invention includeUNIX™, Linux™, Microsoft Windows™, AIX™, IBM's z/OS™, and others as willoccur to those of skill in the art. The operating system (154) and dataprocessing application (102) in the example of FIG. 1 are shown in RAM(168), but many components of such software typically are stored innon-volatile memory also, such as, for example, on a disk drive (170).

The computer (152) of FIG. 1 includes disk drive adapter (172) coupledthrough expansion bus (160) and bus adapter (158) to processor (156) andother components of the computer (152). Disk drive adapter (172)connects non-volatile data storage to the computer (152) in the form ofdisk drive (170). Disk drive adapters useful in computers configured foroperation of a multi-slice processor according to embodiments of thepresent invention include Integrated Drive Electronics (‘IDE’) adapters,Small Computer System Interface (‘SCSI’) adapters, and others as willoccur to those of skill in the art. Non-volatile computer memory alsomay be implemented for as an optical disk drive, electrically erasableprogrammable read-only memory (so-called ‘EEPROM’ or ‘Flash’ memory),RAM drives, and so on, as will occur to those of skill in the art.

The example computer (152) of FIG. 1 includes one or more input/output(‘I/O’) adapters (178). I/O adapters implement user-orientedinput/output through, for example, software drivers and computerhardware for controlling output to display devices such as computerdisplay screens, as well as user input from user input devices (181)such as keyboards and mice. The example computer (152) of FIG. 1includes a video adapter (209), which is an example of an I/O adapterspecially designed for graphic output to a display device (180) such asa display screen or computer monitor. Video adapter (209) is connectedto processor (156) through a high speed video bus (164), bus adapter(158), and the front side bus (162), which is also a high speed bus.

The exemplary computer (152) of FIG. 1 includes a communications adapter(167) for data communications with other computers (182) and for datacommunications with a data communications network (100). Such datacommunications may be carried out serially through RS-232 connections,through external buses such as a Universal Serial Bus (‘USB’), throughdata communications networks such as IP data communications networks,and in other ways as will occur to those of skill in the art.Communications adapters implement the hardware level of datacommunications through which one computer sends data communications toanother computer, directly or through a data communications network.Examples of communications adapters useful in computers configured foroperation of a multi-slice processor according to embodiments of thepresent invention include modems for wired dial-up communications,Ethernet (IEEE 802.3) adapters for wired data communications, and 802.11adapters for wireless data communications.

The arrangement of computers and other devices making up the exemplarysystem illustrated in FIG. 1 are for explanation, not for limitation.Data processing systems useful according to various embodiments of thepresent invention may include additional servers, routers, otherdevices, and peer-to-peer architectures, not shown in FIG. 1, as willoccur to those of skill in the art. Networks in such data processingsystems may support many data communications protocols, including forexample TCP (Transmission Control Protocol), IP (Internet Protocol),HTTP (HyperText Transfer Protocol), WAP (Wireless Access Protocol), HDTP(Handheld Device Transport Protocol), and others as will occur to thoseof skill in the art. Various embodiments of the present invention may beimplemented on a variety of hardware platforms in addition to thoseillustrated in FIG. 1.

For further explanation, FIG. 2 sets forth a block diagram of a portionof a multi-slice processor according to embodiments of the presentinvention. The multi-slice processor in the example of FIG. 2 includes adispatch network (202). The dispatch network (202) includes logicconfigured to dispatch instructions for execution among executionslices.

The multi-slice processor in the example of FIG. 2 also includes anumber of execution slices (204 a, 204 b-204 n). Each execution sliceincludes general purpose registers (206) and a history buffer (208). Thegeneral purpose registers and history buffer may sometimes be referredto as the mapping facility, as the registers are utilized for registerrenaming and support logical registers.

The general purpose registers (206) are configured to store the youngestinstruction directed to a particular logical register and the result ofthe execution of the instruction. A logical register is an abstractionof a physical register that enables out-of-order execution ofinstructions that target the same physical register.

When a younger instruction directed to the same particular logicalregister is received, the entry in the general purpose register is movedto the history buffer. The history buffer (208) may be configured tostore many instructions directed to the same logical register. That is,the general purpose register is generally configured to store a single,youngest instruction for each logical register while the history buffermay store many, non-youngest instructions for each logical register.

Each execution slice (204) of the multi-slice processor of FIG. 2 alsoincludes an execution reservation station (210). The executionreservation station (210) may be configured to issue instructions forexecution. The execution reservation station (210) may include an issuequeue. The issue queue may include an entry for each operand of aninstruction. The execution reservation station may issue the operandsfor execution by an arithmetic logic unit (212) or to a load slice (222a-222 n) via the results bus (220).

The arithmetic logic unit depicted in the example of FIG. 2 may becomposed of many components, such as add logic, multiply logic, floatingpoint units, vector/scalar units, and so on. Once an arithmetic logicunit executes an operand, the result of the execution may be stored inthe result buffer (214) or provided on the results bus (220) through amultiplexer (216).

The results bus may be configured in a variety of manners and be ofcomposed in a variety of sizes. In some instances, each execution slicemay be configured to provide results on a single bus line of the resultsbus (220). In a similar manner, each load/store slice may be configuredto provide results on a single bus line of the results bus (220). Insuch a configuration, a multi-slice processor with four processor slicesmay have a results bus with eight bus lines—four bus lines assigned toeach of the four load/store slices and four bus lines assigned to eachof the four execution slices. Each of the execution slices may beconfigured to snoop results on any of the bus lines of the results bus.In some embodiments, any instruction may be dispatched to a particularexecution unit and then by issued to any other slice for performance. Assuch, any of the execution slices may be coupled to all of the bus linesto receive results from any other slice. Further, each load/store slicemay be coupled to each bus line in order to receive an issue load/storeinstruction from any of the execution slices. Readers of skill in theart will recognize that many different configurations of the results busmay be implemented.

The multi-slice processor in the example of FIG. 2 also includes anumber of load/store slices (222 a, 222 b-222 n). Each load/store sliceincludes a queue (224), a multiplexer (228), a data cache (232),unaligned data logic (234) and formatting logic (226). The queuereceives load and store operations to be carried out by the load/storeslice (222).

The unaligned data logic (234) of each slice is coupled to the unaligneddata logic of another slice through the unaligned data line (236). Theunaligned data logic (234) enables data to be stored and retrievedacross multiple load/store slices. The formatting logic (226) formatsdata into a form that may be returned on the results bus (220) to anexecution slice as a result of a load instruction.

For further explanation, FIG. 3 sets forth a flow chart illustrating anexemplary method of operation of a multi-slice processor. The stepsdepicted in the method of FIG. 3 may be carried out by a multi-sliceprocessor similar to that in the example of FIG. 2. Such a multi-sliceprocessor may include a plurality of execution slices and a plurality ofload/store slices, where the load/store slices are coupled to theexecution slices via a results bus.

The method of FIG. 3 includes retrieving (302), from the results businto an entry (334) of a register file of an execution slice,speculative result data (330) of a load instruction generated by aload/store slice (312). The register file may be a general purposeregister configured to hold the youngest instruction targeting a logicalregister, with each entry in the general purpose register representing adifferent logical register. Alternatively, the register file may be ahistory buffer in which each entry holds an instruction targeting alogical register that is not the youngest instruction targeting thatlogical register. When an instruction is received that targets a logicalregister and an instruction is presently stored in the general purposeregister that also targets that logical register, the instruction storedin the general purpose register is evicted to the history buffer.

The term ‘speculative result data’ refers to data returned by aload/store slice to an execution unit as a result of a load instructionprior to confirming by the load/store slice that the data returned isvalid data. Such speculative result data may be returned prior to theconfirmation of data validity by retrieving the data from a cache lineof the load/store slice prior to the load/store slice checking thestatus flags of the cache line. Such status flags may indicate that thedata in the cache is valid or dirty, and so on. Confirming that suchdata is not speculative may take up to a predetermined period of time.

In the method of FIG. 3, retrieving (302) speculative result data of aload instruction from the results bus may include storing (304) a sliceidentifier (326) of the load/store slice (312) in the entry (334) of theregister file; setting (306) a flag (336) in the entry of the registerfile indicating that result data is written in the entry; andinitializing (308) a timer (332) in the entry to the predeterminedperiod of time. The execution slice may also set a flag (328) indicatingthat a load finish is pending.

In some embodiments, each load/store slice is coupled to a different,single line of the results bus. As such, each bus line may represent aparticular slice. Storing (304) a slice identifier (326) of theload/store slice (312) in the entry (334) of the register file may becarried out by determining the bus line the result data was retrievedfrom and store the slice identifier associated with that bus line in theentry. In other embodiments, the load/store slice may broadcast, alongwith the result data, the slice identifier of the load/store slice.

In the method of FIG. 3, initializing (308) the timer may includesetting (310) a most significant bit of the one-hot bit string high.That is, the timer may be implemented as a set of bits, one bit for eachcycle that occurs while the load/store slice is determining whether thedata provided as a result is speculative or valid. Consider, forexample, that the load/store slice takes four clock cycles to determinevalidity of the speculative data provided to the execution slice as aresult of a load instruction. In such an embodiment, the one-hot bitstring may be implemented as with 4-bits. Initializing the timer in suchan embodiment may be carried out by setting the most significant bit ofthat bit string high. The countdown proceeds by shifting the high bitone bit each clock cycle toward the least significant bit. In theexample of FIG. 3, the one-hot bit string timer (332) of the registerfile entry (334) proceeds through four clock cycles as follows:

-   a. t_(0: 1000)-   b. t_(0: 0100)-   c. t_(0: 0010)-   d. t_(0: 0001)

Readers of skill in the art will recognize that many other timers may beimplemented to track the predetermined amount of time that it takes forthe load/store slice to confirm validity of the speculative data. Forexample, a similar timer as that described above may be implemented inwhich the one-hot bit string may be initialized by setting the leastsignificant bit high and shifting the high bit by one bit, each clockcycle, toward the most significant bit. In other embodiments, all bitsof the bit string may be set high, and upon each clock cycle, adifferent one of the bits may be set low until all are set low. Theinverse (high for low and low for high) may be implemented as well.Further, the timer need not be implemented in the entry itself, but maybe implemented in other components of a multi-slice processor includinga counter facility or the like.

The method of FIG. 3 also includes determining (316), from theload/store slice after expiration of a predetermined period of time,whether the result data is valid. In the method of FIG. 3, determining(316) whether the result data is valid is carried out by counting down(318) by the timer (332) the predetermined period of time and,responsive to the timer counting down the predetermined period of time,utilizing (322) the slice identifier (326) to retrieve a valid data flag(314) value from the load/store slice. The value of the valid data flagindicates whether most recent returned result data is valid. That is,once the load/store slice determines whether the data is valid, theload/store slice sets the value of the valid flag (314) accordingly. Insome embodiments, the load/store slice may broadcast the flag along withthe instruction identifier of the load instruction on the results busand the execution slice may retrieve the valid flag from the bus bysnooping the instruction identifier (324) on the results bus line forthe slice identifier of the load/store slice. In some embodiments, theexecution slice may query or directly retrieve the valid flag from theload/store slice through use of the slice identifier.

As mentioned above, counting down (318) by the timer the predeterminedperiod of time may be carried out, in some embodiments, by shifting(320), upon each subsequent clock cycle, the bit set high toward a leastsignificant bit of the one-hot bit string. The countdown completes whenthe least significant bit is high.

If the data is determined to be not valid, the execution slice may clearthe flag (336) in the entry of the register file indicating whetherresult data is written in the entry. In this way, source instructionshaving as its source the logical register of the load instruction willnot utilize the invalid data. If the data is determined to be valid, theexecution slice may clear the load finish pending flag and keep the flagindicating data written into the entry set. In this way, each sourceinstruction having as its source the logical register of the loadinstruction may utilize the valid data stored in the entry.

For further explanation, FIG. 4 sets forth a flow chart illustrating afurther exemplary method of operation of a multi-slice processoraccording to embodiments of the present invention. The method of FIG. 4is similar to the method of FIG. 3 in that the method of FIG. 4 may alsobe carried out by a multi-slice processor similar to that of FIG. 2 andthe method of FIG. 4 includes retrieving (302), from the results businto an entry (324) of a register file of an execution slice,speculative result data of a load instruction generated by a load/storeslice (312); and determining (316), from the load/store slice afterexpiration of a predetermined period of time, whether the result data isvalid.

The method of FIG. 4, however, differs from the method of FIG. 3 in thatthe method of FIG. 4 also includes in the method of FIG. 4, an entry inan issue queue includes a source instruction, where the sourceinstruction is dependent upon results of a producer instruction and theproducer instruction is a load instruction. To that end, the method ofFIG. 4 includes issuing (402) the source instruction responsive toidentifying that result data has been retrieved from the results businto an entry of the register file for the producer instruction,independent of whether the result data is valid. That is, upon the flag(336 in FIG. 3) in the producer instruction's entry indicating whetherdata has been received as a result is set, the issue queue may issue thesource instruction. Here, the issue queue does not wait until the datahas been confirmed valid.

The present invention may be a system, a method, and/or a computerprogram product. The computer program product may include a computerreadable storage medium (or media) having computer readable programinstructions thereon for causing a processor to carry out aspects of thepresent invention.

The computer readable storage medium can be a tangible device that canretain and store instructions for use by an instruction executiondevice. The computer readable storage medium may be, for example, but isnot limited to, an electronic storage device, a magnetic storage device,an optical storage device, an electromagnetic storage device, asemiconductor storage device, or any suitable combination of theforegoing. A non-exhaustive list of more specific examples of thecomputer readable storage medium includes the following: a portablecomputer diskette, a hard disk, a random access memory (RAM), aread-only memory (ROM), an erasable programmable read-only memory (EPROMor Flash memory), a static random access memory (SRAM), a portablecompact disc read-only memory (CD-ROM), a digital versatile disk (DVD),a memory stick, a floppy disk, a mechanically encoded device such aspunch-cards or raised structures in a groove having instructionsrecorded thereon, and any suitable combination of the foregoing. Acomputer readable storage medium, as used herein, is not to be construedas being transitory signals per se, such as radio waves or other freelypropagating electromagnetic waves, electromagnetic waves propagatingthrough a waveguide or other transmission media (e.g., light pulsespassing through a fiber-optic cable), or electrical signals transmittedthrough a wire.

Computer readable program instructions described herein can bedownloaded to respective computing/processing devices from a computerreadable storage medium or to an external computer or external storagedevice via a network, for example, the Internet, a local area network, awide area network and/or a wireless network. The network may comprisecopper transmission cables, optical transmission fibers, wirelesstransmission, routers, firewalls, switches, gateway computers and/oredge servers. A network adapter card or network interface in eachcomputing/processing device receives computer readable programinstructions from the network and forwards the computer readable programinstructions for storage in a computer readable storage medium withinthe respective computing/processing device.

Computer readable program instructions for carrying out operations ofthe present invention may be assembler instructions,instruction-set-architecture (ISA) instructions, machine instructions,machine dependent instructions, microcode, firmware instructions,state-setting data, or either source code or object code written in anycombination of one or more programming languages, including an objectoriented programming language such as Smalltalk, C++ or the like, andconventional procedural programming languages, such as the “C”programming language or similar programming languages. The computerreadable program instructions may execute entirely on the user'scomputer, partly on the user's computer, as a stand-alone softwarepackage, partly on the user's computer and partly on a remote computeror entirely on the remote computer or server. In the latter scenario,the remote computer may be connected to the user's computer through anytype of network, including a local area network (LAN) or a wide areanetwork (WAN), or the connection may be made to an external computer(for example, through the Internet using an Internet Service Provider).In some embodiments, electronic circuitry including, for example,programmable logic circuitry, field-programmable gate arrays (FPGA), orprogrammable logic arrays (PLA) may execute the computer readableprogram instructions by utilizing state information of the computerreadable program instructions to personalize the electronic circuitry,in order to perform aspects of the present invention.

Aspects of the present invention are described herein with reference toflowchart illustrations and/or block diagrams of methods, apparatus(systems), and computer program products according to embodiments of theinvention. It will be understood that each block of the flowchartillustrations and/or block diagrams, and combinations of blocks in theflowchart illustrations and/or block diagrams, can be implemented bycomputer readable program instructions.

These computer readable program instructions may be provided to aprocessor of a general purpose computer, special purpose computer, orother programmable data processing apparatus to produce a machine, suchthat the instructions, which execute via the processor of the computeror other programmable data processing apparatus, create means forimplementing the functions/acts specified in the flowchart and/or blockdiagram block or blocks. These computer readable program instructionsmay also be stored in a computer readable storage medium that can directa computer, a programmable data processing apparatus, and/or otherdevices to function in a particular manner, such that the computerreadable storage medium having instructions stored therein comprises anarticle of manufacture including instructions which implement aspects ofthe function/act specified in the flowchart and/or block diagram blockor blocks.

The computer readable program instructions may also be loaded onto acomputer, other programmable data processing apparatus, or other deviceto cause a series of operational steps to be performed on the computer,other programmable apparatus or other device to produce a computerimplemented process, such that the instructions which execute on thecomputer, other programmable apparatus, or other device implement thefunctions/acts specified in the flowchart and/or block diagram block orblocks.

The flowchart and block diagrams in the Figures illustrate thearchitecture, functionality, and operation of possible implementationsof systems, methods, and computer program products according to variousembodiments of the present invention. In this regard, each block in theflowchart or block diagrams may represent a module, segment, or portionof instructions, which comprises one or more executable instructions forimplementing the specified logical function(s). In some alternativeimplementations, the functions noted in the block may occur out of theorder noted in the figures. For example, two blocks shown in successionmay, in fact, be executed substantially concurrently, or the blocks maysometimes be executed in the reverse order, depending upon thefunctionality involved. It will also be noted that each block of theblock diagrams and/or flowchart illustration, and combinations of blocksin the block diagrams and/or flowchart illustration, can be implementedby special purpose hardware-based systems that perform the specifiedfunctions or acts or carry out combinations of special purpose hardwareand computer instructions.

It will be understood from the foregoing description that modificationsand changes may be made in various embodiments of the present inventionwithout departing from its true spirit. The descriptions in thisspecification are for purposes of illustration only and are not to beconstrued in a limiting sense. The scope of the present invention islimited only by the language of the following claims.

What is claimed is:
 1. A multi-slice processor comprising: a pluralityof execution slices; and a plurality of load/store slices, wherein theplurality of load/store slices are coupled to the plurality of executionslices via a results bus and an execution slice of the plurality ofexecution slices is configured to: retrieve, from the results bus intoan entry of a register file in the execution slice, speculative resultdata of a load instruction, the speculative load data generated by aload/store slice, the retrieving including: storing a slice identifierof the load/store slice in the entry of the register file, setting aflag in the entry of the register file indicating that result data iswritten in the entry, and initializing a timer in the entry to apredetermined period of time; and determine, from the load/store sliceafter expiration of the predetermined period of time, whether thespeculative result data is valid, the determining including: countingdown by the timer the predetermined period of time; and utilizing theslice identifier to retrieve a valid data flag value from the load/storeslice responsive to the timer counting down the predetermined period oftime, wherein the valid data flag value indicates whether most recentreturned result data is valid.
 2. The multi-slice processor of claim 1wherein: the timer comprises a one-hot bit string; initializing thetimer comprises setting a most significant bit of the one-hot bit stringhigh; and counting down by the timer the predetermined period of timecomprises shifting, upon each subsequent clock cycle, the bit set hightoward a least significant bit of the one-hot bit string, wherein thecounting down by the timer completes when the least significant bit ishigh.
 3. The multi-slice processor of claim 1 further comprising anissue queue, wherein: an entry in the issue queue includes a sourceinstruction, wherein the source instruction is dependent upon results ofa producer instruction and the producer instruction is a loadinstruction; and the issue queue is configured to: issue the sourceinstruction responsive to the execution slice identifying that resultdata has been retrieved from the results bus into an entry of theregister file for the producer instruction, independent of whether theretrieved result data for the producer instruction is valid.
 4. Themulti-slice processor of claim 1 wherein the register file comprises ageneral purpose register.
 5. The multi-slice processor of claim 1wherein the register file is a history buffer.
 6. The multi-sliceprocessor of claim 1 wherein each execution slice includes aninstruction queue, a general purpose register, a history buffer, and anarithmetic execution unit, wherein each execution slice is associatedwith a load-store slice to form a single slice of the multi-sliceprocessor.
 7. An apparatus comprising: a multi-slice processor thatincludes a plurality of execution slices and a plurality of load/storeslices, wherein the plurality of load/store slices are coupled to theplurality of execution slices via a results bus; and a computer memoryoperatively coupled to the multi-slice processor, wherein an executionslice of the plurality of execution slices is configured to: retrieve,from the results bus into an entry of a register file in the executionslice, speculative result data of a load instruction, the speculativeresult data generated by a load/store slice, the retrieving including:storing a slice identifier of the load/store slice in the entry of theregister file, setting a flag in the entry of the register fileindicating that result data is written in the entry, and initializing atimer in the entry to a predetermined period of time; and determine,from the load/store slice after expiration of the predetermined periodof time, whether the speculative result data is valid, the determiningincluding: counting down by the timer the predetermined period of time;and utilizing the slice identifier to retrieve a valid data flag valuefrom the load/store slice responsive to the timer counting down thepredetermined period of time, wherein the valid data flag valueindicates whether most recent returned result data is valid.
 8. Theapparatus of claim 7 wherein: the timer comprises a one-hot bit string;initializing the timer comprises setting a most significant bit of theone-hot bit string high; and counting down by the timer thepredetermined period of time comprises shifting, upon each subsequentclock cycle, the bit set high toward a least significant bit of theone-hot bit string, wherein the counting down by the timer completeswhen the least significant bit is high.
 9. The apparatus of claim 7wherein: the multi-slice processor further includes an issue queue; anentry in the issue queue includes a source instruction, wherein thesource instruction is dependent upon results of a producer instructionand the producer instruction is a load instruction; and the issue queueis configured to: issue the source instruction responsive to theexecution slice identifying that result data has been retrieved from theresults bus into an entry of the register file for the producerinstruction, independent of whether the retrieved result data for theproducer instruction is valid.
 10. The apparatus of claim 7 wherein theregister file comprises a general purpose register.
 11. The apparatus ofclaim 7 wherein the register file is a history buffer.